Time Optimal d-List Colouring of a Graph
نویسنده
چکیده
We present the first linear time algorithm for d-list colouring of a graph—i.e. a proper colouring of each vertex v by colours coming from lists L(v) of sizes at least deg(v). Previously, procedures with such complexity were only known for ∆-list colouring, where for each vertex v one has |L(v)| ≥ ∆, the maximum of the vertex degrees. An implementation of the procedure is available.
منابع مشابه
List-colourings of Near-outerplanar Graphs
A list-colouring of a graph is an assignment of a colour to each vertex v from its own list L(v) of colours. Instead of colouring vertices we may want to colour other elements of a graph such as edges, faces, or any combination of vertices, edges and faces. In this thesis we will study several of these different types of list-colouring, each for the class of a near-outerplanar graphs. Since a g...
متن کاملGraph Colouring Problems and Their Applications in Scheduling
Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems. In this paper we review several variants of graph colouring, such as precolouring extension, list colouring, multicolouring, minimum sum colouring, and discuss their applications in scheduling.
متن کاملSeparation choosability and dense bipartite induced subgraphs
We study a restricted form of list colouring, for which every pair of lists that correspond to adjacent vertices may not share more than one colour. The optimal list size such that a proper list colouring is always possible given this restriction, we call separation choosability. We show for bipartite graphs that separation choosability increases with (the logarithm of) the minimum degree. This...
متن کاملOn-Line List Colouring of Graphs
This paper studies on-line list colouring of graphs. It is proved that the online choice number of a graph G on n vertices is at most χ(G) ln n + 1, and the on-line b-choice number of G is at most eχ(G)−1 e−1 (b − 1 + lnn) + b. Suppose G is a graph with a given χ(G)-colouring of G. Then for any (χ(G) ln n + 1)-assignment L of G, we give a polynomial time algorithm which constructs an L-colourin...
متن کاملColouring perfect graphs with bounded clique number
A graph is perfect if the chromatic number of every induced subgraph equals the size of its largest clique, and an algorithm of Grötschel, Lovász, and Schrijver [9] from 1988 finds an optimal colouring of a perfect graph in polynomial time. But this algorithm uses the ellipsoid method, and it is a well-known open question to construct a “combinatorial” polynomial-time algorithm that yields an o...
متن کامل